The minimum rank problem over the finite field of order 2:minimum rank 3
نویسندگان
چکیده
Abstract Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring how some of these results over the finite field of order 2 extend to arbitrary fields and demonstrate that at least one third of the 62 are minimal forbidden subgraphs over an arbitrary field for the class of graphs having minimum rank at most 3 in that field.
منابع مشابه
The Minimum Rank Problem over Finite Fields
Let Gk(F ) = {G | mr(F,G) ≤ k}, the set of simple graphs with minimum rank at most k. The problem of finding mr(F,G) and describing Gk(F ) has recently attracted considerable attention, particularly for the case in which F = R (see [Nyl96, CdV98, JD99, Hsi01, JS02, CHLW03, vdH03, BFH04, BvdHL04, HLR04, AHK05, BD05, BFH05a, BFH05b, BvdHL05, DK06, BF07]). The minimum rank problem over R is a sub-...
متن کاملAn upper bound for the minimum rank of a graph
For a graph G of order n, the minimum rank of G is defined to be the smallest possible rank over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. We prove an upper bound for minimum rank in terms of minimum degree of a vertex is valid for many graphs, including all bipartite graphs, and conjecture this bound ...
متن کاملVariants on the minimum rank problem: A survey II∗
1 The minimum rank problem for a (simple) graph G is to determine the smallest possible 2 rank over all real symmetric matrices whose ijth entry (for i 6= j) is nonzero whenever {i, j} 3 is an edge in G and is zero otherwise. This paper surveys the many developments on the 4 (standard) minimum rank problem and its variants since the survey paper [36]. In particular, 5 positive semidefinite mini...
متن کاملEla Even and Odd Tournament Matrices with Minimum Rank over Finite Fields
The (0, 1)-matrix A of order n is a tournament matrix provided A + A + I = J, where I is the identity matrix, and J = Jn is the all 1’s matrix of order n. It was shown by de Caen and Michael that the rank of a tournament matrix A of order n over a field of characteristic p satisfies rankp(A) ≥ (n − 1)/2 with equality if and only if n is odd and AA = O. This article shows that the rank of a tour...
متن کاملOptimal STBC over PSK signal sets from cyclotomic field extensions
An n l (l n) space time block code (STBC) C over a complex signal set S consists of a finite number of n l matrices with elements from S. For quasi-static, flat fading channels a primary performance index of C is the minimum of the rank of the difference of any two matrices, called the rank of the code. C is of full rank if its rank is n and is of minimum delay if l = n. The rate R, in bits per...
متن کامل